package com.gzq.leet;

import java.util.Deque;
import java.util.LinkedList;

/*
* 积水洼地识别
* */
public class No42WaterPuddle {

    //先找到局部封闭的洼地，然后重新遍历计算积水
    public int s1(int[] height){
        int sum=0,tmp_sum=0;
        int left_p=-1,right_p=-1,water_level=0;
        Deque<Integer> deque=new LinkedList<Integer>();
        for(int i=0;i< height.length-1;i++){
            int h1=height[i];
            int h2=height[i+1];

        }

        return sum;
    }
}
